Difference sets with few character values

Finite p-groups with few non-linear irreducible character kernels

Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

Hypercube Embedding of Distances with Few Values Hypercube Embedding of Distances with Few Values

A distance d on a nite set V is hypercube embeddable if it can be isometrically embedded into the hypercube f0; 1g m for some m 1, i.e., if the elements i 2 V can be labeled by sets A i in such a way that d(i; j) = jA i 4A j j for all i; j 2 V. Testing whether a distance d is hypercube embeddable is an NP-complete problem, even if d is assumed to take its values in f2; 3; 4; 6g ((Chv80]). On th...

Nonsolvable groups with few character degrees

finite p-groups with few non-linear irreducible character kernels

abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

Orthocomplemented difference lattices with few generators

The algebraic theory of quantum logics overlaps in places with certain areas of cybernetics, notably with the field of artificial intelligence (see, e. g., [19, 20]). Recently an effort has been exercised to advance with logics that possess a symmetric difference ([13, 14]) – with so called orthocomplemented difference lattices (ODLs). This paper further contributes to this effort. In [13] the ...